منابع مشابه
Multiple alignment and multiple sequence based searches
Multiple sequence alignments reveal patterns of conservation that can be exploited in database searches using “profile” methods. Starting with a single nematode sequence that has no informative BLAST hits, I give a real example of the use of multiple alignment and profile search software to detect informative remote homologies. It used to be that most new sequences were novel, with no informati...
متن کاملEmpirical statistical estimates for sequence similarity searches.
The FASTA package of sequence comparison programs has been modified to provide accurate statistical estimates for local sequence similarity scores with gaps. These estimates are derived using the extreme value distribution from the mean and variance of the local similarity scores of unrelated sequences after the scores have been corrected for the expected effect of library sequence length. This...
متن کاملScores for sequence searches and alignments.
Every sequence comparison method requires a set of scores. For aligning protein sequences, substitution scores are based on models of amino acid conservation and properties, and matrices of these scores have substantially improved in recent years. Position-specific scoring matrices provide representations of sequence families that are capable of detecting subtle similarities. Comprehensive eval...
متن کاملFaster sequence homology searches by clustering subsequences
MOTIVATION Sequence homology searches are used in various fields. New sequencing technologies produce huge amounts of sequence data, which continuously increase the size of sequence databases. As a result, homology searches require large amounts of computational time, especially for metagenomic analysis. RESULTS We developed a fast homology search method based on database subsequence clusteri...
متن کاملBlossom Tree Graphical Models
We combine the ideas behind trees and Gaussian graphical models to form a new nonparametric family of graphical models. Our approach is to attach nonparanormal “blossoms”, with arbitrary graphs, to a collection of nonparametric trees. The tree edges are chosen to connect variables that most violate joint Gaussianity. The non-tree edges are partitioned into disjoint groups, and assigned to tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Genetics
سال: 2016
ISSN: 1471-0056,1471-0064
DOI: 10.1038/nrg.2016.25